# axiom scheme

axiom scheme
система аксиом

English-Russian dictionary of computer science and programming. 2013.

### Смотреть что такое "axiom scheme" в других словарях:

• axiom scheme — noun A formula in the language of an axiomatic system, in which one or more schematic variables appear, which stand for any term or subformula of the system, which may or may not be required to satisfy certain conditions. Syn: axiom schema …   Wiktionary

• Axiom — This article is about logical propositions. For other uses, see Axiom (disambiguation). In traditional logic, an axiom or postulate is a proposition that is not proven or demonstrated but considered either to be self evident or to define and… …   Wikipedia

• Axiom schema of specification — For the separation axioms in topology, see separation axiom. In axiomatic set theory and the branches of logic, mathematics, and computer science that use it, the axiom schema of specification, axiom schema of separation, subset axiom scheme or… …   Wikipedia

• axiom schema — noun A formula in the language of an axiomatic system, in which one or more schematic variables appear, which stand for any term or subformula of the system, which may or may not be required to satisfy certain conditions. Syn: axiom scheme …   Wiktionary

• Trent Accreditation Scheme — The Trent Accreditation Scheme (TAS) [cite web |url=http://www.trentaccreditationscheme.org/ |title=Trent Accreditation Scheme |format= |work= |accessdate=2008 06 03] is a United Kingdom based non profit organisation formed with a mission to… …   Wikipedia

• Bernoulli scheme — In mathematics, the Bernoulli scheme or Bernoulli shift is a generalization of the Bernoulli process to more than two possible outcomes.[1][2] Bernoulli schemes are important in the study of dynamical systems, as most such systems (such as Axiom… …   Wikipedia

• Second-order arithmetic — In mathematical logic, second order arithmetic is a collection of axiomatic systems that formalize the natural numbers and sets thereof. It is an alternative to axiomatic set theory as a foundation for much, but not all, of mathematics. The… …   Wikipedia

• Reverse mathematics — is a program in mathematical logic that seeks to determine which axioms are required to prove theorems of mathematics. The method can briefly be described as going backwards from the theorems to the axioms. This contrasts with the ordinary… …   Wikipedia

• Curry–Howard correspondence — A proof written as a functional program: the proof of commutativity of addition on natural numbers in the proof assistant Coq. nat ind stands for mathematical induction, eq ind for substitution of equals and f equal for taking the same function… …   Wikipedia

• Zermelo set theory — Zermelo set theory, as set out in an important paper in 1908 by Ernst Zermelo, is the ancestor of modern set theory. It bears certain differences from its descendants, which are not always understood, and are frequently misquoted. This article… …   Wikipedia

• Cantor's diagonal argument — An illustration of Cantor s diagonal argument for the existence of uncountable sets. The sequence at the bottom cannot occur anywhere in the list of sequences above. Cantor s diagonal argument, also called the diagonalisation argument, the… …   Wikipedia

### Поделиться ссылкой на выделенное

##### Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»